A dynamic model and parallel tabu search heuristic for real-time ambulance relocation
نویسندگان
چکیده
This paper considers the redeployment problem for a fleet of ambulances. This problem is encountered in the real-time management of emergency medical services. A dynamic model is proposed and a dynamic ambulance management system is described. This system includes a parallel tabu search heuristic to precompute redeployment scenarios. Simulations based on real-data confirm the efficiency of the proposed approach. Résumé On considère dans cet article le problème de redéploiement d'une flotte d'ambulances. Ce problème intervient lors de la gestion en temps réel d'un système de véhicules d'urgence. On propose pour ce problème un modèle dynamique et l'on décrit un système de gestion en temps réel de la flotte d'ambulance. Ce système comprend une méthode heuristique parallèle afin de déterminer à l'avance des scénarios de redéploiement. Des simulations produites à partir de données réelles confirment la pertinence de l'approche proposée. Mots-clefs : véhicules d'urgence, modèles de couverture, heuristique avec recherche tabou, temps réel.
منابع مشابه
A Hybrid Dynamic Programming for Inventory Routing Problem in Collaborative Reverse Supply Chains
Inventory routing problems arise as simultaneous decisions in inventory and routing optimization. In the present study, vendor managed inventory is proposed as a collaborative model for reverse supply chains and the optimization problem is modeled in terms of an inventory routing problem. The studied reverse supply chains include several return generators and recovery centers and one collection...
متن کاملAmbulance routing in disaster response scenario considering different types of ambulances and semi soft time windows
This paper studies the ambulance routing problem (ARP) in disaster situations when a large number of injured people from various locations require receiving treatments and medical aids. In such circumstances, many people summoning the ambulances but the capacity and number of emergency vehicles are not sufficient to visit all the patients at the same time. Therefore, a pivotal issue is to manag...
متن کاملHeuristic Solution of an Extended Double-Coverage Ambulance Location Problem for Austria
In this paper, we present solution procedures to tackle an ambulance location problem in Austria. We consider the problem as a doublecoverage ambulance location problem, and for specifying it in formal terms, we use an extension of a model developed by Gendreau, Laporte and Semet [11] by introducing a limit on the number of inhabitants served per ambulance. To solve the problem, we reimplemente...
متن کاملA novel heuristic algorithm for capacitated vehicle routing problem
The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...
متن کاملA heuristic approach for multi-stage sequence-dependent group scheduling problems
We present several heuristic algorithms based on tabu search for solving the multi-stage sequence-dependent group scheduling (SDGS) problem by considering minimization of makespan as the criterion. As the problem is recognized to be strongly NP-hard, several meta (tabu) search-based solution algorithms are developed to efficiently solve industry-size problem instances. Also, two different initi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Parallel Computing
دوره 27 شماره
صفحات -
تاریخ انتشار 2001